def recursion_fibonacci_sequence(n):
    print('### 使用递归斐波那契数列实例')

    def func(num):
        # 内部递归函数 输出斐波那契数列
        if num <= 1:
            return num
        else:
            return func(num - 1) + func(num - 2)

    for i in range(n):
        print('*' * func(i))


recursion_fibonacci_sequence(9)